Orthogonal Bases for Polynomial Regres- Sion with Derivative Information in Uncer- Tainty Quantification
نویسندگان
چکیده
We discuss the choice of polynomial basis for approximation of uncertainty propagation through complex simulation models with capability to output derivative information. Our work is part of a larger research effort in uncertainty quantification using sampling methods augmented with derivative information. The approach has new challenges compared with standard polynomial regression. In particular, we show that a tensor product multivariate orthogonal polynomial basis of an arbitrary degree may no longer be constructed. We provide sufficient conditions for an orthonormal set of this type to exist, a basis for the space it spans. We demonstrate the benefits of the basis in the propagation of material uncertainties through a simplified model of heat transport in a nuclear reactor core. Compared with the tensor product Hermite polynomial basis, the orthogonal basis results in a better numerical conditioning of the regression procedure, a modest improvement in approximation error when basis polynomials are chosen a priori, and a significant improvement when basis polynomials are chosen adaptively, using a stepwise fitting procedure.
منابع مشابه
An efficient hybrid method for uncer- tainty quantification
A technique for coupling an intrusive and non-intrusive uncertainty quantification method is proposed. The intrusive approach uses a combination of polynomial chaos and stochastic Galerkin projection. The non-intrusive method uses numerical integration by combining quadrature rules and the probability density functions of the prescribed uncertainties. A strongly stable coupling procedure betwee...
متن کاملA multi agent method for cell formation with uncertain situation, based on information theory
This paper assumes the cell formation problem as a distributed decision network. It proposes an approach based on application and extension of information theory concepts, in order to analyze informational complexity in an agent- based system, due to interdependence between agents. Based on this approach, new quantitative concepts and definitions are proposed in order to measure the amount of t...
متن کاملTractable Problems in Bayesian Networks
The complexity of probabilistic reasoning with Bayesian networks has recently been proven to be NP complete So reducing the complexity of such networks is an active issue in uncer tainty reasoning Much work on such as compressing the probabilistic information for Bayesian networks and optimal approximation algorithm for Bayesian inference has been suggested In this paper we study a class of tra...
متن کاملDevelopment of Fuzzy Database Systems 2.0 Information System with Uncer-tainty Handling Isrs with Uncertainty Handling
Describes i) necessity of fuzzy DataBase ii) techniques used in the storage and retrieval of fuzzy data in a DataBase or information retrieval system iii) DataBase framework for fuzzy DataBase and iv) the advantages of using object-oriented DataBase framework in fuzzy DataBase. A prototype of fuzzy object-oriented DataBase system, (FOODS), has been developed to demonstrate the feasibility of fu...
متن کاملEXPECTED PAYOFF OF TRADING STRATEGIES INVOLVING EUROPEAN OPTIONS FOR FUZZY FINANCIAL MARKET
Uncertainty inherent in the financial market was usually consid- ered to be random. However, randomness is only one special type of uncer- tainty and appropriate when describing objective information. For describing subjective information it is preferred to assume that uncertainty is fuzzy. This paper defines the expected payoof trading strategies in a fuzzy financial market within the framewor...
متن کامل